- binary polynomial
- мат.двоичный многочлен
English-Russian scientific dictionary. 2008.
binary polynomial
Смотреть что такое "binary polynomial" в других словарях:
Sparse binary polynomial hashing — (SBPH) is a generalization of Bayesian filtering that can match mutating phrases as well as single words. SBPH is a way of generating a large number of features from an incoming text automatically, and then using statistics to determine the… … Wikipedia
Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… … Wikipedia
Polynomial hierarchy — In computational complexity theory, the polynomial hierarchy is a hierarchy of complexity classes that generalize the classes P, NP and co NP to oracle machines.DefinitionsThere are multiple equivalent definitions of the classes of the polynomial … Wikipedia
Polynomial ring — In mathematics, especially in the field of abstract algebra, a polynomial ring is a ring formed from the set of polynomials in one or more variables with coefficients in another ring. Polynomial rings have influenced much of mathematics, from the … Wikipedia
Polynomial code — In coding theory, a polynomial code is a type of linear code whose set of valid code words consists of those polynomials (usually of some fixed length) that are divisible by a given fixed polynomial (of shorter length, called the generator… … Wikipedia
Binary decision diagram — In the field of computer science, a binary decision diagram (BDD) or branching program, like a negation normal form (NNF) or a propositional directed acyclic graph (PDAG), is a data structure that is used to represent a Boolean function. On a… … Wikipedia
Binary quadratic form — In mathematics, a binary quadratic form is a quadratic form in two variables. More concretely, it is a homogeneous polynomial of degree 2 in two variables where a, b, c are the coefficients. Properties of binary quadratic forms depend in an… … Wikipedia
Schwartz-Zippel lemma and testing polynomial identities — Polynomial identity testing is the problem of determining whether a given multivariate polynomial is the0 polynomial or identically equal to 0. The input to the problem is an n variable polynomial over a fieldF. It can occur in the following… … Wikipedia
Pseudo-polynomial time — In computational complexity theory, a numeric algorithm runs in pseudo polynomial time if its running time is polynomial in the numeric value of the input (which is exponential in the length of the input its number of digits).An ExampleConsider… … Wikipedia
Enumerator polynomial — In coding theory, the weight enumerator polynomial of a binary linear code specifies the number of words of each possible Hamming weight. Let be a binary linear code length n. The weight distribution is the sequence of numbers giving the number… … Wikipedia
All one polynomial — An all one polynomial (AOP) is a polynomial used in finite fields, specifically GF(2) (binary). The AOP is a 1 equally spaced polynomial.An AOP of degree m has all terms from x m to x 0 with coefficients of 1, and can be written as:AOP(x) = sum… … Wikipedia
